Perron–Frobenius theorem for matrices with some negative entries

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Matrices with Nilpotent Entries, and Their Determinants

The present note is really a Section in a forthcoming treatise [4] on differential forms in the context of Synthetic Differential Geometry (elaborating on [2], [3], [1]); but since the methods of this Section fall entirely within elementary linear algebra over a commutative ring R, we believe that it might be of more general interest, and worthwile a separate publication. The base ring R over w...

متن کامل

Almost Hadamard Matrices with Complex Entries

We discuss an extension of the almost Hadamard matrix formalism, to the case of complex matrices. Quite surprisingly, the situation here is very different from the one in the real case, and our conjectural conclusion is that there should be no such matrices, besides the usual Hadamard ones. We verify this conjecture in a number of situations, and notably for most of the known examples of real a...

متن کامل

A Grauert Type Theorem and Extension of Matrices with Entries in H

In the paper we prove an extension theorem for matrices with entries in H (U) for U being a Riemann surface of a special type. One of the main components of the proof is a Grauert type theorem for “holomorphic” vector bundles defined over maximal ideal spaces of certain Banach algebras.

متن کامل

Ranks of matrices with few distinct entries

An L-matrix is a matrix whose off-diagonal entries belong to a set L, and whose diagonal is zero. Let N(r, L) be the maximum size of a square L-matrix of rank at most r. Many applications of linear algebra in extremal combinatorics involve a bound on N(r, L). We review some of these applications, and prove several new results on N(r, L). In particular, we classify the sets L for which N(r, L) i...

متن کامل

Extension of matrices with Laurent polynomial entries

Let P and Q be nr, r n matrices with Laurent polynomial entries. Suppose that Q T (z)P (z) = I r , z 2 Cnf0g. This note provides an algorithmatic construction of two n(nr) matrices G and H with Laurent polynomial entries such that the nn matrices

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2001

ISSN: 0024-3795

DOI: 10.1016/s0024-3795(00)00327-x